Abstract Termination of Linear Rewriting Systems* -preliminary Version

TERMINATION OF LINEAR REWRITING SYSTEMS* preliminary version Nachum Dershowitz Department of Computer Science University of Illinois Urbana, Illinois 61801 U.S.A. Limitations, such as right-linearity, on the form of rules in a termrewriting system are shown to restrict the class of derivations that must be considered when determining whether or not the system terminates for all inputs. These restricted derivations, termed "chains", are obtained by attempting to apply rules to the final terms of derivations that issue from the left-hand side of rules. Similar limitations are shown to guarantee that combining two terminating systems yields a terminating system.